L(0, 1)-Labelling of Cactus Graphs
نویسندگان
چکیده
An -labelling of a graph is an assignment of nonnegative integers to the vertices of such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an 0,1 L G G 0,1 L -labelling is the maximum label number assigned to any vertex of . The G 0,1 L G 0,1 , G 1 k 1 -labelling number of a graph , denoted by is the least integer such that G has an -labelling of span . This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by -labelling and have shown that, k 0, L 0, L 0,1 G 1 for a cactus graph, where is the degree of the graph . 0,1 L = , G V E G
منابع مشابه
On the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملLabelling Graphs with the Circular Difference∗
For positive integers k and d ≥ 2, a k-S(d, 1)-labelling of a graph G is a function on the vertex set of G, f : V (G) → {0, 1, 2, · · · , k− 1}, such that |f(u)− f(v)|k ≥ { d if dG(u, v) = 1; 1 if dG(u, v) = 2, where |x|k = min{|x|, k − |x|} is the circular difference modulo k. In general, this kind of labelling is called the S(d, 1)-labelling. The σdnumber of G, σd(G), is the minimum k of a k-...
متن کاملDistance-two labellings of Hamming graphs
Let j ≥ k ≥ 0 be integers. An `-L(j, k)-labelling of a graph G = (V , E) is a mapping φ : V → {0, 1, 2, . . . , `} such that |φ(u)−φ(v)| ≥ j if u, v are adjacent and |φ(u)−φ(v)| ≥ k if they are distance two apart. Let λj,k(G) be the smallest integer ` such that G admits an `-L(j, k)-labelling. Define λj,k(G) to be the smallest ` if G admits an `-L(j, k)-labelling with φ(V ) = {0, 1, 2, . . . , ...
متن کاملL(2, 1)-Labeling of Oriented Planar Graphs
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus graphs. For these subclasses more accurate results are presented. keywords: L(2, 1)-labeling, oriented graph coloring, digraphs, prisms, Halin graphs, cacti.
متن کاملLabelling Graphs with a Condition at Distance 2
Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a function f V(G) [0, oc) such that whenever x, y E V are adjacent, If(x)f(Y)l >2d, and whenever the distance between x and y is two, If(x) f(Y)l >d. The Ld(2, 1)-labelling number A(G, d) is the smallest number m such that G has an Ld(2, 1)-labelling f with max{f(v) v E V} m. It is shown that to determine A(G, ...
متن کامل